5 Addition and Subspace Theorems for Asymptotic Large Inductive Dimension
نویسنده
چکیده
We prove addition and subspace theorems for asymptotic large inductive dimension. We investigate a transfinite extension of this dimension and show that it is trivial. 0. Asymptotic dimension asdim of a metric space was defined by Gromov for studying asymptotic invariants of discrete groups [1]. This dimension can be considered as asymptotic analogue of the Lebesgue covering dimension dim. Dranishnikov has introduced dimension asInd which is analogous to large inductive dimension Ind [2]. Some of basic theorems of classical dimension theory are sum, addition and subspace theorems for different dimensions and classes of topological spaces. Here we mention some of them related to dimension Ind. (All mentioned facts from classic dimension theory could be found in [3]).
منابع مشابه
On Transfinite Extension of Asymptotic Dimension
We prove that a transfinite extension of asymptotic dimension asind is trivial. We introduce a transfinite extension of asymptotic dimension asdim and give an example of metric proper space which has transfinite infinite dimension. 0. Asymptotic dimension asdim of a metric space was defined by Gromov for studying asymptotic invariants of discrete groups [1]. This dimension can be considered as ...
متن کاملIsotropic Constant Dimension Subspace Codes
In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...
متن کاملAsymptotic Bounds for the Sizes of Constant Dimension Codes and an Improved Lower Bound
We study asymptotic lower and upper bounds for the sizes of constant dimension codes with respect to the subspace or injection distance, which is used in random linear network coding. In this context we review known upper bounds and show relations between them. A slightly improved version of the so-called linkage construction is presented which is e.g. used to construct constant dimension codes...
متن کاملBest proximity point theorems in Hadamard spaces using relatively asymptotic center
In this article we survey the existence of best proximity points for a class of non-self mappings which satisfy a particular nonexpansiveness condition. In this way, we improve and extend a main result of Abkar and Gabeleh [A. Abkar, M. Gabeleh, Best proximity points of non-self mappings, Top, 21, (2013), 287-295] which guarantees the existence of best proximity points for nonex...
متن کاملAN INDUCTIVE FUZZY DIMENSION
Using a system of axioms among with a modified definition of boundary on the basis of the intuitionistic fuzzy sets, we formulate an inductive structure for the dimension of fuzzy spaces which has been defined by Coker. This new definition of boundary allows to characterize an intuitionistic fuzzy clopen set as a set with zero boundary. Also, some critical properties and applications are establ...
متن کامل